Unfolding polyhedral bands

نویسندگان

  • Greg Aloupis
  • Erik D. Demaine
  • Stefan Langerman
  • Pat Morin
  • Joseph O'Rourke
  • Ileana Streinu
  • Godfried T. Toussaint
چکیده

A band is defined as the intersection of the surface of a convex polyhedron with the space between two parallel planes, as long as this space does not contain any vertices of the polyhedron. An unfolding of a given band is obtained by cutting along exactly one edge and placing all faces of the band into the plane, without causing intersections. We prove that for a specific type of band there exists an appropriate edge to cut so that the band may be unfolded.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Author's Personal Copy Edge-unfolding Nested Polyhedral Bands

A band is the intersection of the surface of a convex polyhedron with the space between two parallel planes, as long as this space does not contain any vertices of the polyhedron. The intersection of the planes and the polyhedron produces two convex polygons. If one of these polygons contains the other in the projection orthogonal to the parallel planes, then the band is nested. We prove that a...

متن کامل

Band Unfoldings and Prismatoids: A Counterexample

This note shows that the hope expressed in [ADL07]—that the new algorithm for edge-unfolding any polyhedral band without overlap might lead to an algorithm for unfolding any prismatoid without overlap—cannot be realized. A prismatoid is constructed whose sides constitute a nested polyhedral band, with the property that every placement of the prismatoid top face overlaps with the band unfolding.

متن کامل

Edge-unfolding nested polyhedral bands

A band is the intersection of the surface of a convex polyhedron with the space between two parallel planes, as long as this space does not contain any vertices of the polyhedron. The intersection of the planes and the polyhedron produces two convex polygons. If one of these polygons contains the other in the projection orthogonal to the parallel planes, then the band is nested. We prove that a...

متن کامل

Learning to segment and unfold polyhedral mesh from failures

Folding planar sheets to make 3D shapes from is an ancient practice with many new applications, ranging from personal fabrication of customized items to design of surgical instruments for minimally invasive surgery in self-folding machines. Given a polyhedral mesh, unfolding is an operation of cutting and flattening the mesh. The flattened polyhedral nets are then cut out of planar materials an...

متن کامل

Zipper unfoldings of polyhedral complexes

We explore which polyhedra and polyhedral complexes can be formed by folding up a planar polygonal region and fastening it with one zipper. We call the reverse process a zipper unfolding. A zipper unfolding of a polyhedron is a path cut that unfolds the polyhedron to a planar polygon; in the case of edge cuts, these are Hamiltonian unfoldings as introduced by Shephard in 1975. We show that all ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004